Previous | 
Home
Section: Partnerships and Cooperations
International Initiatives
Inria Associate Teams Not Involved in an Inria International Labs
TASCMELB
-
Title: Synergy between Filtering and Explanations for Scheduling and Placement Constraints
-
International Partner (Institution - Laboratory - Researcher):
-
In the context of Constraint Programming and SAT the project addresses the synergy between filtering (removing values from variables) and explanations (explaining why values were removed in term of clauses) in order to handle in a more efficient way correlated resource scheduling and placement constraints. It combines the strong point of Constraint Programming, namely removing value that leads to infeasibility, with the strong point of SAT, namely taking advantage from past failure in order to quickly identify infeasible sub-problems. In 2016 we got the following the following new result using rewriting for synthesising filtering algorithm for the Allen constraint: For all 8192 combinations of Allen's 13 relations between one task with origin oi and fixed length li and another task with origin oj and fixed length lj, we give a formula evaluating to a set of integers which are infeasible for a task origin for the given combination. Such forbidden regions are useful e.g. in a range-consistency maintaining propagator for an Allen constraint in finite domain constraint programming. No visit to Melbourne was done this year because of VISA problem. Consequently we also did remotly (i.e. from Nantes) the following result: the availability of the time-series constraints of the time-series constraint catalog available in the MiniZinc modelling language (and consequently made them accessible to solvers like Choco or Cplex).